Search forψ(2S)→γηc(2S)via fully reconstructedηc(2S)decays

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fully Distribute Parallel Global Search Algorithm

The n-dimensional direct search algorithm DIRECT of Jones, Perttunen, and Stuckman has attracted recent attention from the multidisciplinary design optimization community. Since DIRECT only requires function values (or ranking) and balances global exploration with local refinement better than n-dimensional bisection, it is well suited to the noisy function values typical of realistic simulation...

متن کامل

Fully Dynamic Balanced and Distributed Search Trees with Logarithmic Costs

In this paper we consider the dictionary problem in a message passing distributed environment. We introduce a new version of an order-preserving distributed search tree, called BDST for Balanced and Distributed Search Tree, capable to both grow and shrink as long as keys are inserted and deleted. This is the rst distributed data structure to explicitly support both insertion and deletion with l...

متن کامل

Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding

The nonlinear vector precoding (VP) technique has been proven to achieve close-to-capacity performance in multiuser multipleinput multiple-output (MIMO) downlink channels. The performance benefit with respect to its linear counterparts stems from the incorporation of a perturbation signal that reduces the power of the precoded signal. The computation of this perturbation element, which is known...

متن کامل

Autoseek towards a Fully Automated Video Search System

.................................................................................................................................................................... iii Acknowledgements .................................................................................................................................................. vi CHAPTER

متن کامل

Speeding up maximal fully-correlated itemsets search in large databases

Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Our previous work on the maximal fully-correlated itemset (MFCI) framework can rule out the itemsets with irrelevant items and its downward-closed property helps to achieve good computational performance. However, to calculate the desired MFCIs in large databases,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review D

سال: 2010

ISSN: 1550-7998,1550-2368

DOI: 10.1103/physrevd.81.052002